Comparing Flow-Based Binding-Time Analyses

نویسنده

  • Jens Palsberg
چکیده

Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are formulated in radically different ways, making comparison non-trivial. In this paper we demonstrate how to compare such analyses. We prove that the first and the fourth analyses can be specified by constraint systems of a particular form, enabling direct comparison. As corollaries, we get that Bondorf’s analysis is more conservative than ours, that both analyses can be performed in cubic time, and that the core of Bondorf’s analysis is correct. Our comparison is of analyses that apply to the pure λ-calculus.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Flow - based Binding - time

Binding-time analyses based on ow analysis have been presented by Bondorf, Consel, Bondorf and JJrgensen, and Schwartzbach and the present author. The analyses are formulated in radically diierent ways, making comparison non-trivial. In this paper we demonstrate how to compare such analyses. We prove that the rst and the fourth analyses can be speciied by constraint systems of a particular form...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times

This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...

متن کامل

Chaotic Analysis and Prediction of River Flows

Analyses and investigations on river flow behavior are major issues in design, operation and studies related to water engineering. Thus, recently the application of chaos theory and new techniques, such as chaos theory, has been considered in hydrology and water resources due to relevant innovations and ability. This paper compares the performance of chaos theory with Anfis model and discusses ...

متن کامل

On Static and Dynamic Control-Flow Information in Program Analysis and Transformation

This thesis addresses several aspects of static and dynamic control-flow information in programming languages, by investigating its interaction with program transformation and program analysis. Control-flow information indicates for each point in a program the possible program points to be executed next. Control-flow information in a program may be static, as when the syntax of the program dire...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995